Approximation algorithms for channel assignment with constraints
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Channel Assignment with Constraints
Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interference. An algorithm for the channel assignment problem must assign as many channels as the weight indicates to every node, such that any two channels assigned to the same node satisfy the co-site constraint, and any two channels assigned to adj...
متن کاملModels and Approximation Algorithms for Channel Assignment in Radio Networks
Models and Approximation Algorithms for Channel Assignment in Radio Networks Sven O. Krumke a; Madhav V. Marathe b; S. S. Ravi ; a Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustr. 7, 14195 Berlin, Germany. Email: [email protected]. b P.O. Box 1663, MS M997, Los Alamos National Laboratory, Los Alamos, NM 87545. Email: [email protected]. University at Albany – State University of New York,...
متن کاملApproximation Algorithms for Minimum Span Channel Assignment Problems
We propose polynomial time approximation algorithms for minimum span channel (frequency) assignment problems, which is known to be NP-hard. Let α be the approximation ratio of our algorithm and W ≥ 2 be the maximum of numbers of channels required in vertices. If an instance is defined on a perfect graph G, then α ≤ 1+ (1+ 1 W−1 )Hω(G), where Hi denotes the i-th harmonic number. For any instance...
متن کاملApproximation Algorithms for Wavelength Assignment
Winkler and Zhang introduced the FIBER MINIMIZATION problem in [3]. They showed that the problem is NP-complete but left the question of approximation algorithms open. We give a simple 2-approximation algorithm for this problem. We also show how ideas from the Dynamic Storage Allocation algorithm of Buchsbaum et al [1] can be used to give an approximation ratio arbitrarily close to 1 provided t...
متن کاملAlgorithms for Dynamic Channel Assignment
The eeciency of channel assignment in a cellular telephone system is considered using the measures of successful channel assignment ratio as well as response time. Existing paradigms of mutual exclusion and dining philosophers from distributed systems are used to synthesize new algorithms that optimize both measures. The results are veriied by extensive simulations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00388-1